Lagrange Interpolation on Chebyshev Points of Two Variables
نویسنده
چکیده
We study interpolation polynomials based on the points in [−1, 1]× [−1, 1] that are common zeros of quasi-orthogonal Chebyshev polynomials and nodes of near minimal degree cubature formula. With the help of the cubature formula we establish the mean convergence of the interpolation polynomials. 1991 Mathematics Subject Classification: Primary 41A05, 33C50.
منابع مشابه
A numerical study of the Xu polynomial 2 interpolation formula in two variables 3
8 In his paper " Lagrange interpolation on Chebyshev points of two variables " (J. 9 220–238), Y. Xu proposed a set of Chebyshev like points for polynomial interpolation in the square 10 [−1, 1] 2 , and derived a compact form of the corresponding Lagrange interpolation formula. We inves-11 tigate computational aspects of the Xu polynomial interpolation formula like numerical stability and 12 ef...
متن کاملBivariate Lagrange Interpolation at the Chebyshev Nodes
We discuss Lagrange interpolation on two sets of nodes in two dimensions where the coordinates of the nodes are Chebyshev points having either the same or opposite parity. We use a formula of Xu for Lagrange polynomials to obtain a general interpolation theorem for bivariate polynomials at either set of Chebyshev nodes. An extra term must be added to the interpolation formula to handle all poly...
متن کاملBivariate Interpolation at Xu Points: Results, Extensions and Applications
In a recent paper, Y. Xu proposed a set of Chebyshev-like points for polynomial interpolation on the square [−1, 1]. We have recently proved that the Lebesgue constant of these points grows like log of the degree (as with the best known points for the square), and we have implemented an accurate version of their Lagrange interpolation formula at linear cost. Here we construct non-polynomial Xu-...
متن کاملLebesgue constants in polynomial interpolation
Lagrange interpolation is a classical method for approximating a continuous function by a polynomial that agrees with the function at a number of chosen points (the “nodes”). However, the accuracy of the approximation is greatly influenced by the location of these nodes. Now, a useful way to measure a given set of nodes to determine whether its Lagrange polynomials are likely to provide good ap...
متن کاملStability of Barycentric Interpolation Formulas
The barycentric interpolation formula defines a stable algorithm for evaluation at points in [−1, 1] of polynomial interpolants through data on Chebyshev grids. Here it is shown that for evaluation at points in the complex plane outside [−1, 1], the algorithm becomes unstable and should be replaced by the alternative modified Lagrange or “first barycentric” formula dating to Jacobi in 1825. Thi...
متن کامل